LAPACK Working Note 41 Installation Guide for LAPACK 1

LAPACK Working Note ? LAPACK Block Factorization Algorithms on the Intel iPSC / 860 ∗

The aim of this project is to implement the basic factorization routines for solving linear systems of equations and least squares problems from LAPACK—namely, the blocked versions of LU with partial pivoting, QR, and Cholesky on a distributed-memory machine. We discuss our implementation of each of the algorithms and the results we obtained using varying orders of matrices and blocksizes.

|||||||| Lapack Working Note 116 |||||||| Parallel Matrix Distributions: Have We Been Doing It All Right? Parallel Matrix Distributions: Have We Been Doing It All Right?

A Testing Infrastructure for Lapack’s Symmetric Eigensolvers∗

LAPACK is often mentioned as a positive example of a software library that encapsulates complex, robust, and widely used numerical algorithms for a wide range of applications. At installation time, the user has the option of running a (limited) number of test cases to verify the integrity of the installation process. On the algorithm developer’s side, however, more exhaustive tests are usually ...

Preliminary LAPACK Users' Guide

LAPACK is a transportable library of Fortran 77 subroutines for solving the most common problemsin numerical linear algebra: systems of linear equations, linear least squares problems, eigenvalueproblems and singular value problems. It has been designed to be e cient on a wide range of modernhigh-performance computers. This is a Preliminary Users' Guide to Release 1.0 of LAPACK....

LAPACK Working Note 9 A Test Matrix Generation

We discuss the design and implementation of a suite of test matrix generators for testing linear algebra software. These routines generate random matrices with certain properties which are useful for testing linear equation solving, least squares, and eigendecomposition software. These properties include the spectrum, symmetry, bandwidth, norm, sparsity, conditioning (with respect to inversion ...